Symmetric Polynomials over Zm and Simultaneous Communication Protocol

نویسندگان

  • Nayantara Bhatnagar
  • Parikshit Gopalan
  • Richard J. Lipton
چکیده

We study the problem of representing symmetric Boolean functions as symmetric polynomials over . We show an equivalence between such representations and simultaneous communication protocols. Computing a function with a polynomial of degree modulo is equivalent to a two player simultaneous protocol for computing where one player is given the first digits of the weight in base and the other is given the first digits of the weight in base . This reduces the problem of proving bounds on the degree of symmetric polynomials to proving bounds on simultaneous communication protocols. We use this equivalence to show lower bounds of "!$# on symmetric polynomials weakly representing classes of

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetric polynomials over Zm and simultaneous communication protocols

We study the problem of representing symmetric Boolean functions as symmetric polynomials over Zm. We show an equivalence between such representations and simultaneous communication protocols. Computing a function f on 0 1 inputs with a polynomial of degree d modulo pq is equivalent to a two player simultaneous protocol for computing f where one player is given the first dlogp de digits of the ...

متن کامل

An efficient symmetric polynomial-based key establishment protocol for wireless sensor networks

An essential requirement for providing secure services in wireless sensor networks is the ability to establish pairwise keys among sensors. Due to resource constraints on the sensors, the key establishment scheme should not create significant overhead. To date, several key establishment schemes have been proposed. Some of these have appropriate connectivity and resistance against key exposure, ...

متن کامل

Buckling and vibration analysis of angle -ply symmetric laminated composite plates with fully elastic boundaries

The main focus of this paper is on efficiency analysis of two kinds of approximating functions (characteristic orthogonal polynomials and characteristic beam functions) that have been applied in the Rayleigh-Ritz method to determine the non-dimensional buckling and frequency parameters of an angle ply symmetric laminated composite plate with fully elastic boundaries. It has been observed that o...

متن کامل

Jack Polynomials and Hilbert Schemes of Points on Surfaces

The Jack (symmetric) polynomials P (α) λ (x) form a class of symmetric polynomials which are indexed by a partition λ and depend rationally on a parameter α. They reduced to the Schur polynomials when α = 1, and to other classical families of symmetric polynomials for several specific parameters. Recently they attracts attention from various points of view, for example the integrable systems an...

متن کامل

Lower Bounds for Approximations by Low Degree Polynomials Over Zm

We use a Ramsey-theoretic argument to obtain the first lower bounds for approximations over Zm by nonlinear polynomials: A degree-2 polynomial over Zm (m odd) must differ from the parity function on at least a 1=2 1=2(logn) (1) fraction of all points in the Boolean n-cube. A degree-O(1) polynomial over Zm (m odd) must differ from the parity function on at least a 1=2 o(1) fraction of all points...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003